Compiling Pattern Matching by Term Decomposition

Compiling Pattern Matching in Join-Patterns

Rotation-invariant pattern matching using wavelet decomposition

Pixel-by-pixel template matching is very time-consuming. For an input image of size N N × , and the template of size W W × , the computational complexity is O( 2 2 N W‧ ), given that the object orientations in both images are coincident. When we search an object with unknown orientation, the straightforward way to do template matching is to rotate the reference template in every possible orient...

Generalized pattern matching using orbit decomposition

Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an image under various transformations and at various locations. This process is of very high time complexity since a search must be implemented both in the transformation domain and in the spatial domain. Contributing to th...

Fast Pattern-Matching via k-bit Filtering Based Text Decomposition

This study explores an alternative way of storing text files to answer exact match queries faster. We decompose the original file into two parts as filter and payload. The filter part contains the most informative k bits of each byte, and the remaining bits of the bytes are concatenated in the order of appearance to generate the payload. We refer to this structure as k-bit filtered format. When...

Automatic Parallelization by Pattern-Matching

We present the top{down design of a new system which performs automatic parallelization of numerical Fortran 77 or C source programs for execution on distributed{memory message { passing multi-processors such as e.g. the INTEL iPSC860 or the TMC CM{5. The key idea is a high{level pattern{matching approach which in some useful way permits partial restructuring of a wide class of numerical progra...